One-Error Linear Complexity over Fp of Sidelnikov Sequences
نویسندگان
چکیده
Let p be an odd prime and m be a positive integer. In this paper, we prove that the one-error linear complexity over Fp of Sidelnikov sequences of length p − 1 is ( p+1 2 ) − 1, which is much less than its (zero-error) linear complexity.
منابع مشابه
On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences
For a Sidelnikov sequence of period pm − 1 we obtain tight lower bounds on its linear complexity L over Fp. In particular, these bounds imply that, uniformly over all p and m, L is close to its largest possible value pm − 1.
متن کاملBounds on the Linear Complexity and the 1-Error Linear Complexity over Fp of M-ary Sidel'nikov Sequences
In this paper, we derive linear complexity over Fp of the M -ary Sidel’nikov sequences using discrete Fourier transform. As an example, we represent the linear complexities of the ternary Sidel’nikov sequences. It turned out that the ternary Sidel’nikov sequences have the linear complexity nearly close to their periods.
متن کاملRemarks on the k-error linear complexity of pn-periodic sequences
Recently the first author presented exact formulas for the number of 2-periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k ≥ 2, of a random 2-periodic binary sequence. A crucial role for the analysis played the Chan-Games algorithm. We use a more s...
متن کاملOn the linear complexity of bounded integer sequences over different moduli
We give a relation between the linear complexity over the integers and over the residue rings modulo m of a bounded integer sequence. This relation can be used to obtain a variety of new results for several sequences widely studied in the literature. In particular we apply it to Sidelnikov sequences.
متن کاملOn the linear complexity of Legendre-Sidelnikov sequences
Background • Legendre Sequence For a prime p > 2 let (s n) be the Legendre sequence defined as s n = 1, n p = −1, 0, otherwise, n ≥ 0, where. p denotes the Legendre symbol. • Sidelnikov Sequence Let q be an odd prime power, g a primitive element of F q , and let η denote the quadratic character of F Background • Legendre Sequence For a prime p > 2 let (s n) be the Legendre sequence defined as s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004